DUAL CODE AND MACWILLIAMS IDENTITY ON ADDITIVE CODE

Dymo: Tracking Dynamic Code Identity

Code identity is a primitive that allows an entity to recognize a known, trusted application as it executes. This primitive supports trusted computing mechanisms such as sealed storage and remote attestation. Unfortunately, there is a generally acknowledged limitation in the implementation of current code identity mechanisms in that they are fundamentally static. That is, code identity is captu...

Quasi-Cyclic Complementary Dual Code

LCD codes are linear codes that intersect with their dual trivially. Quasi-cyclic codes that are LCD are characterized and studied by using their concatenated structure. Some asymptotic results are derived. Hermitian LCD codes are introduced to that end and their cyclic subclass is characterized. Constructions of QCCD codes from codes over larger alphabets are given.

New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities

With the Delsarte-MacWilliams inequalities as a starting point, an upper bound is obtained on the rate of a binary code as a function of its minimum distance. This upper bound is asymptotically less than Levenshtein’s bound, and so also Elias’s.

Sex-specific norms code face identity.

Face identity aftereffects suggest that an average face, which is continuously updated by experience, functions as a norm for coding identity. Sex-contingent figural face aftereffects indicate that different norms are maintained for male and female faces but do not directly implicate them in coding identity. Here, we investigated whether sex-specific norms are used to code the identities of mal...

Code Generation for a Dual Instruction Set Processor Based on Selective Code Transformation